Foreword: asynchronous cellular automata and nature-inspired computation
نویسندگان
چکیده
منابع مشابه
Delay-insensitive computation in asynchronous cellular automata
Asynchronous cellular automata (ACA) are cellular automata that allow cells to update their states independently at random times. Because of the unpredictability of the order of update, computing on ACA is usually done by simulating a timing mechanism to force all cells into synchronicity after which well-established synchronous methods of computation can be used. In this paper, we present a mo...
متن کاملReversible Computation in Asynchronous Cellular Automata
Reversible computation has attracted much attention over the years, not only for its promise for computers with radically reduced power consumption, but also for its importance for Quantum Computing. Though studied extensively in a great variety of synchronous computation models, it is virtually unexplored in an asynchronous framework. Particularly suitable asynchronous models for the study of ...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملWeighted Asynchronous Cellular Automata
We study weighted distributed systems whose behavior can be described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the non-deterministic case. As a consequence, we obtain a particularly simple class of sequential weighted automata that have already the full expressive power.
متن کاملReversibility in Asynchronous Cellular Automata
The reversibility issue of one-dimensional asynchronous cellular automata (ACAs) is addressed in this paper. The cells of ACAs are updated independently. The cellular automata (CAs) rules are classified as reversible and irreversible rules. The irreversible rules cannot configure reversible ACAs. The reversible rules may configure reversible ACAs depending upon the update of ACA cells. Finally,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2012
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-012-9309-x